Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles
نویسندگان
چکیده
منابع مشابه
A Set-to-Set Disjoint Paths Routing Algorithm in a Torus-Connected Cycles Network
Torus-Connected Cycles (TCC) have been recently proposed as interconnection network for massively parallel systems. In order to increase system dependability and interprocessor communication performance, disjoint paths routing is critical. In this paper, we focus on the set-to-set disjoint paths routing problem which consists in select mutually node-disjoint paths between two sets of nodes. As ...
متن کاملSet-to-Set Disjoint-Paths Routing in Recursive Dual-Net
Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric base-network. A k-level dualconstruction for k > 0 creates a network containing (2n0) k /2 nodes with node-degree d0 + k, where n0 and d0 are the number of nodes and the node-degree of the base network, respectively. The RDN is a sym...
متن کاملTime Optimal Node-to-Set Disjoint Paths Routing in Hypercubes
Due to their simplicity, hypercubes are a popular topology for the interconnection network of massively parallel systems. One critical issue when dealing with such parallel systems is routing: data transmission is at the center of any operation or computation. Additionally, as the number of processors inside modern supercomputers is huge, and continuously growing, fault tolerance ought to be ad...
متن کاملConnected dominating set in graphs without long paths and cycles
The ratio of the connected domination number, γc, and the domination number, γ, is strictly bounded from above by 3. It was shown by Zverovich that for every connected (P5, C5)-free graph, γc = γ. In this paper, we investigate the interdependence of γ and γc in the class of (Pk, Ck)-free graphs, for k ≥ 6. We prove that for every connected (P6, C6)-free graph, γc ≤ γ+1 holds, and there is a fam...
متن کاملDisjoint cycles intersecting a set of vertices
A classic theorem of Erdős and Pósa states that there exists a constant c such that for all positive integers k and graphs G, either G contains k vertex disjoint cycles, or there exists a subset of at most ck log k vertices intersecting every cycle of G. We consider the following generalization of the problem: fix a subset S of vertices of G. An S-cycle is a cycle containing at least one vertex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2016
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2016edl8099